Termination w.r.t. Q proof of /home/nowonder/forschung/aprove/satrung/aprove/lpar16/TRCSRSLASHEx6_GM04

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

active₁(c) -> mark₁(f₁(g₁(c)))
active₁(f₁(g₁(X))) -> mark₁(g₁(X))
proper₁(c) -> ok₁(c)
proper₁(f₁(X)) -> f₁(proper₁(X))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₁(ok₁(X)) -> ok₁(f₁(X))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

active₁(c) -> mark₁(f₁(g₁(c)))
active₁(f₁(g₁(X))) -> mark₁(g₁(X))
proper₁(c) -> ok₁(c)
proper₁(f₁(X)) -> f₁(proper₁(X))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₁(ok₁(X)) -> ok₁(f₁(X))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

TOP₁(mark₁(X)) -> PROPER₁(X)
PROPER₁(g₁(X)) -> G₁(proper₁(X))
PROPER₁(g₁(X)) -> PROPER₁(X)
PROPER₁(f₁(X)) -> PROPER₁(X)
TOP₁(ok₁(X)) -> TOP₁(active₁(X))
ACTIVE₁(c) -> F₁(g₁(c))
F₁(ok₁(X)) -> F₁(X)
TOP₁(mark₁(X)) -> TOP₁(proper₁(X))
G₁(ok₁(X)) -> G₁(X)
ACTIVE₁(c) -> G₁(c)
TOP₁(ok₁(X)) -> ACTIVE₁(X)
PROPER₁(f₁(X)) -> F₁(proper₁(X))

The TRS R consists of the following rules:

active₁(c) -> mark₁(f₁(g₁(c)))
active₁(f₁(g₁(X))) -> mark₁(g₁(X))
proper₁(c) -> ok₁(c)
proper₁(f₁(X)) -> f₁(proper₁(X))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₁(ok₁(X)) -> ok₁(f₁(X))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

TOP₁(mark₁(X)) -> PROPER₁(X)
PROPER₁(g₁(X)) -> G₁(proper₁(X))
PROPER₁(g₁(X)) -> PROPER₁(X)
PROPER₁(f₁(X)) -> PROPER₁(X)
TOP₁(ok₁(X)) -> TOP₁(active₁(X))
ACTIVE₁(c) -> F₁(g₁(c))
F₁(ok₁(X)) -> F₁(X)
TOP₁(mark₁(X)) -> TOP₁(proper₁(X))
G₁(ok₁(X)) -> G₁(X)
ACTIVE₁(c) -> G₁(c)
TOP₁(ok₁(X)) -> ACTIVE₁(X)
PROPER₁(f₁(X)) -> F₁(proper₁(X))

The TRS R consists of the following rules:

active₁(c) -> mark₁(f₁(g₁(c)))
active₁(f₁(g₁(X))) -> mark₁(g₁(X))
proper₁(c) -> ok₁(c)
proper₁(f₁(X)) -> f₁(proper₁(X))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₁(ok₁(X)) -> ok₁(f₁(X))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 4 SCCs with 6 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

G₁(ok₁(X)) -> G₁(X)

The TRS R consists of the following rules:

active₁(c) -> mark₁(f₁(g₁(c)))
active₁(f₁(g₁(X))) -> mark₁(g₁(X))
proper₁(c) -> ok₁(c)
proper₁(f₁(X)) -> f₁(proper₁(X))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₁(ok₁(X)) -> ok₁(f₁(X))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

G₁(ok₁(X)) -> G₁(X)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
G₁(x1) = G₁(x1)
ok₁(x1) = ok₁(x1)

Lexicographic Path Order [19].
Precedence:

ok₁ > G₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(c) -> mark₁(f₁(g₁(c)))
active₁(f₁(g₁(X))) -> mark₁(g₁(X))
proper₁(c) -> ok₁(c)
proper₁(f₁(X)) -> f₁(proper₁(X))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₁(ok₁(X)) -> ok₁(f₁(X))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

F₁(ok₁(X)) -> F₁(X)

The TRS R consists of the following rules:

active₁(c) -> mark₁(f₁(g₁(c)))
active₁(f₁(g₁(X))) -> mark₁(g₁(X))
proper₁(c) -> ok₁(c)
proper₁(f₁(X)) -> f₁(proper₁(X))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₁(ok₁(X)) -> ok₁(f₁(X))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

F₁(ok₁(X)) -> F₁(X)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
F₁(x1) = F₁(x1)
ok₁(x1) = ok₁(x1)

Lexicographic Path Order [19].
Precedence:

ok₁ > F₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ PisEmptyProof

          ↳ QDP

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(c) -> mark₁(f₁(g₁(c)))
active₁(f₁(g₁(X))) -> mark₁(g₁(X))
proper₁(c) -> ok₁(c)
proper₁(f₁(X)) -> f₁(proper₁(X))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₁(ok₁(X)) -> ok₁(f₁(X))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(g₁(X)) -> PROPER₁(X)
PROPER₁(f₁(X)) -> PROPER₁(X)

The TRS R consists of the following rules:

active₁(c) -> mark₁(f₁(g₁(c)))
active₁(f₁(g₁(X))) -> mark₁(g₁(X))
proper₁(c) -> ok₁(c)
proper₁(f₁(X)) -> f₁(proper₁(X))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₁(ok₁(X)) -> ok₁(f₁(X))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

PROPER₁(f₁(X)) -> PROPER₁(X)

The remaining pairs can at least by weakly be oriented.

PROPER₁(g₁(X)) -> PROPER₁(X)

Used ordering: Combined order from the following AFS and order.
PROPER₁(x1) = PROPER₁(x1)
g₁(x1) = x1
f₁(x1) = f₁(x1)

Lexicographic Path Order [19].
Precedence:

trivial

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

PROPER₁(g₁(X)) -> PROPER₁(X)

The TRS R consists of the following rules:

active₁(c) -> mark₁(f₁(g₁(c)))
active₁(f₁(g₁(X))) -> mark₁(g₁(X))
proper₁(c) -> ok₁(c)
proper₁(f₁(X)) -> f₁(proper₁(X))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₁(ok₁(X)) -> ok₁(f₁(X))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

PROPER₁(g₁(X)) -> PROPER₁(X)

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
PROPER₁(x1) = PROPER₁(x1)
g₁(x1) = g₁(x1)

Lexicographic Path Order [19].
Precedence:

g₁ > PROPER₁

The following usable rules [14] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(c) -> mark₁(f₁(g₁(c)))
active₁(f₁(g₁(X))) -> mark₁(g₁(X))
proper₁(c) -> ok₁(c)
proper₁(f₁(X)) -> f₁(proper₁(X))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₁(ok₁(X)) -> ok₁(f₁(X))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP₁(ok₁(X)) -> TOP₁(active₁(X))
TOP₁(mark₁(X)) -> TOP₁(proper₁(X))

The TRS R consists of the following rules:

active₁(c) -> mark₁(f₁(g₁(c)))
active₁(f₁(g₁(X))) -> mark₁(g₁(X))
proper₁(c) -> ok₁(c)
proper₁(f₁(X)) -> f₁(proper₁(X))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₁(ok₁(X)) -> ok₁(f₁(X))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

TOP₁(mark₁(X)) -> TOP₁(proper₁(X))

The remaining pairs can at least by weakly be oriented.

TOP₁(ok₁(X)) -> TOP₁(active₁(X))

Used ordering: Combined order from the following AFS and order.
TOP₁(x1) = x1
ok₁(x1) = x1
active₁(x1) = x1
mark₁(x1) = mark₁(x1)
proper₁(x1) = x1
c = c
f₁(x1) = f₁(x1)
g₁(x1) = g

Lexicographic Path Order [19].
Precedence:

c > g > [mark₁, f_1]

The following usable rules [14] were oriented:

proper₁(c) -> ok₁(c)
proper₁(f₁(X)) -> f₁(proper₁(X))
proper₁(g₁(X)) -> g₁(proper₁(X))
g₁(ok₁(X)) -> ok₁(g₁(X))
f₁(ok₁(X)) -> ok₁(f₁(X))
active₁(c) -> mark₁(f₁(g₁(c)))
active₁(f₁(g₁(X))) -> mark₁(g₁(X))

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

TOP₁(ok₁(X)) -> TOP₁(active₁(X))

The TRS R consists of the following rules:

active₁(c) -> mark₁(f₁(g₁(c)))
active₁(f₁(g₁(X))) -> mark₁(g₁(X))
proper₁(c) -> ok₁(c)
proper₁(f₁(X)) -> f₁(proper₁(X))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₁(ok₁(X)) -> ok₁(f₁(X))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be strictly oriented and are deleted.

TOP₁(ok₁(X)) -> TOP₁(active₁(X))

The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
TOP₁(x1) = TOP₁(x1)
ok₁(x1) = ok
active₁(x1) = active
c = c
mark₁(x1) = mark
f₁(x1) = f
g₁(x1) = g₁(x1)

Lexicographic Path Order [19].
Precedence:

[c, f] > [TOP₁, ok, g_1] > [active, mark]

The following usable rules [14] were oriented:

active₁(c) -> mark₁(f₁(g₁(c)))
active₁(f₁(g₁(X))) -> mark₁(g₁(X))
g₁(ok₁(X)) -> ok₁(g₁(X))

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

          ↳ QDP

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ QDPOrderProof

                  ↳ QDP

                    ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

active₁(c) -> mark₁(f₁(g₁(c)))
active₁(f₁(g₁(X))) -> mark₁(g₁(X))
proper₁(c) -> ok₁(c)
proper₁(f₁(X)) -> f₁(proper₁(X))
proper₁(g₁(X)) -> g₁(proper₁(X))
f₁(ok₁(X)) -> ok₁(f₁(X))
g₁(ok₁(X)) -> ok₁(g₁(X))
top₁(mark₁(X)) -> top₁(proper₁(X))
top₁(ok₁(X)) -> top₁(active₁(X))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.